Randomization in Parallel Algorithms

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Randomization in Parallel Stringology

In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching falls into two categories: standard stringology and nonstandard stringology. Standard Stringology concerns the study of various exact matching problems. The fundamental problem here is the basic string matching problem ...

متن کامل

Randomization in On-line Algorithms

Motto: \\T]ime is unidirectional, past events cannot be reversed, the future is uncertain , and Murphy's Law rules" 39]

متن کامل

Randomization in Discrete Optimization: Annealing Algorithms

Annealing algorithms have been employed extensively in the past decade to solve myriads of optimization problems. Several intractable problems such as the traveling salesperson problem, graph partitioning, circuit layout, etc. have been solved to get satisfactory results. In this article we survey convergence results known for annealing algorithms. In particular we deal with Simulated Annealing...

متن کامل

A Note on Improving the Running Time of a Class of Parallel Algorithms Using Randomization

A natural method to avoid memory access connicts in EREW-PRAM graph algorithms is to compute a large independent set in a constant-degree-bounded connict graph. Many EREW-PRAM algorithms use results from CV 86], GPS 87], which can be used to compute such a set in O(log n) parallel time. This paper gives an O(1) time randomized algorithm using O(n) processors for that problem. Our algorithm impr...

متن کامل

Parallel Randomization for Large Structured Markov Chains

Multiprocessor architectures with few but powerful processors gain more and more popularity. In this paper we describe a parallel iterative algorithm to perform randomization for a continuous time Markov chain with a Kronecker representation on a shared memory architecture. The Kronecker representation is modified for a parallel matrixvector multiplication with a fast multiplication scheme and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Statistical Science

سال: 1993

ISSN: 0883-4237

DOI: 10.1214/ss/1177011085